Stochastic Attributed Relational Graph Matching for Image Near-Duplicate Detection

نویسندگان

  • Dong-Qing Zhang
  • Shih-Fu Chang
چکیده

Attributed Relational Graph (ARG) is a useful model for representing many real-world relational patterns. Computing the similarity of ARGs is a fundamental problem for ARG based modelling. This report presents a novel stochastic framework for computing the similarity of ARGs, which defines the ARG similarity as the likelihood ratio of the stochastic process that transforms one ARG to the other. We show that the transformation likelihood can be factorized and approximately calculated using variational approximation and Loopy Belief Propagation. Furthermore, we show that the similarity measure can be learned from training data using a variational E-M process in an unsupervised manner by using graph-level annotations. We apply the technique to visual scene matching and establish a part-based similarity measure for detecting Near-Duplicate Images in video database.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient graph-based recognizer for hand-drawn symbols

We describe a trainable, multi-stroke symbol recognizer for pen-based user interfaces. The approach is insensitive to orientation, nonuniform scaling, and drawing order. Symbols are represented internally as attributed relational graphs describing both the geometry and topology of the symbols. Symbol definitions are statistical models, which makes the approach robust to variations common in han...

متن کامل

Fast Matching of Hierarchical Attributed Relational Graphs for an Application to Similarity-Based Image Retrieval

This paper describes the fast matching of hierarchical attributed relational graphs with the aim of applying the method to similarity-based image retrieval. Best-first search algorithm, admissible heuristic function, and maximum permissible cost are proposed to speed up the computation of graph matching. By means of these methods, the average computation time of graph matching speeds up about t...

متن کامل

Evaluation of Spatial Similarity Methods for Image Retrieval

Similarity retrieval by spatial content (i.e., using multiple objects and their interelationships) in Image DataBases (IDBs) is still an open problem and has received considerable attention in the literature. In this work, we focus our attention on “queries by example” image and we study methods for answering such queries including the well accepted “editing distance” on Attributed Relational G...

متن کامل

Consumer photo management and browsing facilitated by near-duplicate detection with feature filtering

Near-duplicate detection techniques are exploited to facilitate representative photo selection and region-of-interest (ROI) determination, which are important functionalities for efficient photo management and browsing. To make near-duplicate detection module resist to noisy features, three filtering approaches, i.e., point-based, region-based, and probabilistic latent semantic (pLSA), are deve...

متن کامل

Change Detection from Media Sharing Community

This paper investigates how social images and image change detection techniques can be applied to identify the damages caused by natural disasters for disaster assessment. We propose a framework that takes advantages of near duplicate image detection and robust boundary matching for the change detection in disasters. First we perform the near duplicate detection by local interest point-based ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004